Mysteries in Packing Regular Tetrahedra

نویسندگان

  • Jeffrey C. Lagarias
  • Chuanming Zong
چکیده

T he regular tetrahedron is the simplest Platonic solid. Nevertheless, in studying its packing properties, several renowned scholars have made mistakes, and many questions about it remain unsolved. Currently no one knows the density of its densest packings, the density of its densest translative packings, or the exact value of its congruent kissing number. In this paper we recount historical developments on packing regular tetrahedra, report new results on its translative packing density and congruent kissing number, and formulate several unsolved problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Upper Bound on the Packing Density of Regular Tetrahedra and Octahedra

We obtain an upper bound to the packing density of regular tetrahedra. The bound is obtained by showing the existence, in any packing of regular tetrahedra, of a set of disjoint spheres centered on tetrahedron edges, so that each sphere is not fully covered by the packing. The bound on the amount of space that is not covered in each sphere is obtained in a recursive way by building on the obser...

متن کامل

A Dense Packing of Regular Tetrahedra

We construct a dense packing of regular tetrahedra, with packing density D > .7786157.

متن کامل

Dense Crystalline Dimer Packings of Regular Tetrahedra

We present the densest known packing of regular tetrahedra with density φ = 4000 4671 = 0.856347 . . . . Like the recently discovered packings of Kallus et al. and Torquato–Jiao, our packing is crystalline with a unit cell of four tetrahedra forming two triangular dipyramids (dimer clusters). We show that our packing has maximal density within a three-parameter family of dimer packings. Numeric...

متن کامل

Packing, tiling, and covering with tetrahedra.

It is well known that three-dimensional Euclidean space cannot be tiled by regular tetrahedra. But how well can we do? In this work, we give several constructions that may answer the various senses of this question. In so doing, we provide some solutions to packing, tiling, and covering problems of tetrahedra. Our results suggest that the regular tetrahedron may not be able to pack as densely a...

متن کامل

Dense Periodic Packings of Tetrahedra with Small Repeating Units

We present a one-parameter family of periodic packings of regular tetrahedra, with the packing fraction 100/117 ≈ 0.8547, that are simple in the sense that they are transitive and their repeating units involve only four tetrahedra. The construction of the packings was inspired from results of a numerical search that yielded a similar packing. We present an analytic construction of the packings ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012